package com.sheepone.util.structure.node;

/**
 * @author Miss.杨
 * @description 二叉搜索平衡树节点
 * @since 2024/5/9 - 15:20
 */
public class AVLTreeNode<K extends Comparable<? super K>, V> extends BinarySearchTreeNode<K, V> {

    int height = 1;

    public AVLTreeNode(K key) {
        super(key);
    }

    public AVLTreeNode(K key, V value) {
        super(key, value);
    }

    public AVLTreeNode(V data, BinaryTreeNode<V> left, BinaryTreeNode<V> right) {
        super(data, left, right);
    }

    public int getHeight() {
        return height;
    }

    public void setHeight(int height) {
        this.height = height;
    }
}
